Integer Programming and Arrovian Social Welfare Functions
نویسندگان
چکیده
We characterize the class of Arrovian Social Welfare Functions (ASWFs) as integer solutions to a collection of linear inequalities. Many of the classical possibility, impossibility, and characterization results can be derived in a simple and unified way from this integer program. Among the new results we derive is a characterization of preference domains that admit a nondictatorial, neutral ASWF. We also give a polyhedral characterization of all ASWFs on single-peaked domains.
منابع مشابه
Integer Programming and Social Choice
We characterize the class of Arrovian Social Welfare Functions as integer solutions to a collection of linear inequalities. Many of the known results about impossibility, Arrovian Social Welfare Functions, properties of the majority rule etc., can be derived in a simple and unified way from this integer program. We characterize those preference domains that admit a non-dictatorial, neutral Arro...
متن کاملInteger Programming and Nondictatorial Arrovian Social Welfare Functions
Following Sethuraman, Teo and Vohra ((2003), (2006)), we apply integer programming tools to the analysis of fundamental issues in social choice theory. We generalize Sethuraman et al.’s approach specifying integer programs in which variables are allowed to assume values in the set {0, 12 , 1}. We show that there exists a one-to-one correspondence between the solutions of an integer program defi...
متن کاملNondictatorial Arrovian Social Welfare Functions: An Integer Programming Approach∗
In the line opened by Kalai and Muller (1977), we explore new conditions on preference domains which make it possible to avoid Arrow’s impossibility result. In our main theorem, we provide a complete characterization of the domains admitting nondictatorial Arrovian social welfare functions with ties (i.e. including indifference in the range) by introducing a notion of strict decomposability. In...
متن کاملInteger Programming on Domains Containing Inseparable Ordered Pairs
Using the integer programming approach introduced by Sethuraman, Teo, and Vohra (2003), we extend the analysis of the preference domains containing an inseparable ordered pair, initiated by Kalai and Ritz (1978). We show that these domains admit not only Arrovian social welfare functions “without ties,” but also Arrovian social welfare functions “with ties,” since they satisfy the strictly deco...
متن کاملAnonymous monotonic social welfare functions
This paper presents two results about preference domain conditions that deepen our understanding of anonymous and monotonic Arrovian social welfare functions (ASWFs). We characterize the class of anonymous and monotonic ASWFs on domains without Condorcet triples. This extends and generalizes an earlier characterization (as Generalized Majority Rules) by Moulin (Axioms of Cooperative Decision Ma...
متن کامل